Time-Related Trade-Offs in Dynamic Function Scheduling
نویسندگان
چکیده
A possible route to managing workload peaks facilitated by advances in technology is to use Dynamic Function Allocation, in other words to design work so that it is possible to switch adaptively between levels of automation. In the main, current approaches to Dynamic Function Allocation assume that functions are to be serviced as soon as possible, and in order of arrival. These methods utilise online allocation decisions along the human-automation resource dimension. Dynamic Function Scheduling takes a different approach and considers the organisation of functions along a joint humanautomation timeline using scheduling mechanisms developed for real-time embedded systems. This paper highlights the limitations of Dynamic Function Allocation as currently considered and argues for the introduction of a temporal dimension to work design. Time-related trade-offs faced by the system designer (e.g. flexibility vs. simplicity) and the operator (e.g. value-based scheduling decisions) are discussed.
منابع مشابه
Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage
This article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (UHC). Since the fiscal space is constrained, trade-offs need to be made. But some trade-offs are unacceptable on the path to universal coverage. Unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملA Dynamic Scheduling Benchmark: Design, Implementation and Performance Evaluation
Games, such as Chess, Eight Queens, and Tiles Puzzle, have traditionally been used as popular benchmarks for evaluating different problem solving strategies. Many of the game benchmarks are suitable for evaluating static scheduling techniques. In such benchmarks, the scheduling phase and the execution phase (i.e. when the schedule is executed to play the game) are disjoint. The scheduling techn...
متن کاملAn Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones
Project scheduling Net present value We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...
متن کاملDefining Pathways and Trade-offs Toward Universal Health Coverage; Comment on “Ethical Perspective: Five Unacceptable Trade-offs on the Path to Universal Health Coverage”
The World Health Organization’s (WHO’s) World Health Report 2010, “Health systems financing, the path to universal coverage,” promoted universal health coverage (UHC) as an aspirational objective for country health systems. Yet, in addition to the dimensions of services and coverage, distribution of coverage in the population, and financial risk protection highlighted by the report, the conside...
متن کامل